Degree sequence index strategy

We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence. As an illustration of the DSI strategy, we show how it can be used to give new upper and lower bounds on the k-independence and the k-domination numbers. These include, among other things, a double generalization of the annihilation number, a recently introduced upper bound on the independence number. Next, we use the DSI strategy in conjunction with planarity, to generalize some results of Caro and Roddity about independence number in planar graphs. Lastly, for claw-free and K1,r-free graphs, we use DSI to generalize some results of Faudree, Gould, Jacobson, Lesniak and Lindquester.